Blocking sets in handcuffed designs

نویسنده

  • Salvatore Milici
چکیده

In this paper we determine the spectrum of possible cardinalities of a blocking set in a H(v,3,A) and in a H(v,4,1). Moreover we construct, for each admissible ~9, a H(v,3,1) without blocking sets. Introduction A handcuffed design with parameters v, k, A, or for short an H(v,k,A), consists of a set of ordered k-subsets of a v-set, called handcuffed blocks. In a block (a., a z ' ... ,a!:) each element is said to be "handcuffed" to its neighbours, so that the block contains k-l handcuffed pairs (a l ,a). (a 2 ,a 3 ), ••• , (ak_l,a)::), the pairs being considered unordered. The elements in a block are distinct, so the handcuffed pairs are distinct as well. A collection of b handcuffed blocks forms a handcuffed design if (i) each element of the v-set appears in exactly r of the blocks (ii) each (unordered) pair of distinct elements of the v-set is handcuffed in exactly A of the blocks. It can be shown [9] that every element of V must occur in the interior (that is, not in the first or last position) of exactly u Australasian Journal of Combinatorics Z( 1993), pp.229-236 blocks. Further the following equalities can be shown: .\(v-l)(k-2) u2 (k-l) r.\k(v-l) 2(k-1) b.\v(v-l) 2(k-1) (1) It is well known [12J that a H(v,3,.\) exists if and only if val (mod 4) for A-l,3 (mod 4), v-1 (mod 2) for A-2 (mod 4), all w:3 for .\-0 (mod 4), and a H(v,4,1) exists if and only if val (mod 3). Let (V,B) be a handicuffed design H(v,k,A). A subset S of V is called a ~ ~ if, for every bEB, bnS~ and bn(V\S)~. Blocking sets have been investigated in projective spaces [1,2,13], in t-designs [3,4,6,7,8,10,llJ and in G-designs [5). Let BS(v,k,A)-{h: 3 H(v,k,.\) ~ a ~ oet S ~ ISI-h} . In this paper, we completely determine BS(v,3,A) and BS(v,4,1) for all admissible v. In pd.L·t...l~ular we prove t:hat ~ for VEO (mod 2) BS(v,3,.\){ v;l ~} , 2 for val (mod 2) and that -{ v-I BS(v,4,1) -32V+31 } for val (mod 3) . Moreover, in section 4, we exhibit, for every VEl (mod 4), w:9, a H(v,3,1) without blocking sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding handcuffed designs in D-designs,

Let D be the triangle with attached edge (i. e. D is the graph having vertices {a0, a1, a2, a3} and edges {a0, a1}, {a0, a2}, {a1, a2}, {a0, a3}). J.C. Bermond and J. Schönheim [1], proved that a D-design of order n exists if and only if n ≡ 0 or 1 (mod 8). Let (W, C) be a nontrivial D-design of order n, n ≥ 8, and let V ⊂ W , |V | = v < n. We say that a handcuffed design (V,P) of order v and b...

متن کامل

Embedding handcuffed designs with block size

Let (W, C) be an m-cycle system of order n and let Ω ⊂ W , |Ω| = v < n. We say that a handcuffed design (Ω,P) of order v and block size s (2 ≤ s ≤ m−1) is contained in (W, C) if for every p ∈ P there is an m-cycle c = (a1, a2, . . . , am) ∈ C such that: (1) p = [ak, ak+1, . . . , ak+s−1] for some k ∈ {1, 2, . . . ,m} (i.e. the (s− 1)-path p occurs in the m-cycle c); and (2) ak−1, ak+s ∈ Ω. Note...

متن کامل

Blocking Sets in (v, {2, 4}, 1)-Designs

The existence of blocking sets in (v, {2, 4}, 1)-designs is examined. We show that for v ≡ 0, 3, 5, 6, 7, 8, 9, 11 (mod 12), blocking sets cannot exist. We prove that for each v ≡ 1, 2, 4 (mod 12) there is a (v, {2, 4}, 1)-design with a blocking set with three possible exceptions. The case v ≡ 10 (mod 12) is still open; we consider the first four values of v in this situation.

متن کامل

G-designs without blocking sets, Note

For an undirected graph G and a natural number n, a G-design of order n is an edge partition of the complete graph Kn with n vertices into subgraphs G1, G2, . . . , each isomorphic to G. A set T ⊂ V (Kn) is called a blocking set if it meets the vertex set V (Gi) of each Gi in the decomposition, but contains none of them. In a previous paper [J. Combin. Designs 4 (1996), 135–142] the first and t...

متن کامل

Blocking sets in balanced path designs

Let k ~ 3. For each admissible v, we determine the set BS1i ( v, k, 1) of integers x such that there exists a balanced path design H ( v, k, 1) with a blocking set of cardinality x.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1993